Multiple Structure Recovery via Probabilistic Biclustering

نویسندگان

  • Matteo Denitto
  • Luca Magri
  • Alessandro Farinelli
  • Andrea Fusiello
  • Manuele Bicego
چکیده

Multiple Structure Recovery (MSR) represents an important and challenging problem in the field of Computer Vision and Pattern Recognition. Recent approaches to MSR advocate the use of clustering techniques. In this paper we propose an alternative method which investigates the usage of biclustering in MSR scenario. The main idea behind the use of biclustering approaches to MSR is to isolate subsets of points that behave “coherently” in a subset of models/structures. Specifically, we adopt a recent generative biclustering algorithm and we test the approach on a widely accepted MSR benchmark. The results show that biclustering techniques favorably compares with state-of-the-art clustering methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Latent Feature Model Approach to Biclustering

Biclustering is the unsupervised learning task of mining a data matrix for useful submatrices, for instance groups of genes that are co-expressed under particular biological conditions. As these submatrices are expected to partly overlap, a significant challenge in biclustering is to develop methods that are able to detect overlapping biclusters. The authors propose a probabilistic mixture mode...

متن کامل

Graphical models for biclustering and information retrieval in gene expression data

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author José Caldas Name of the doctoral dissertation Graphical Models for Biclustering and Information Retrieval in Gene Expression Data Publisher School of Science Unit Department of Information and Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 33/2012 Field of research Bioinformatics Manuscript ...

متن کامل

A Convex Optimization Framework for Bi-Clustering

We present a framework for biclustering and clustering where the observations are general labels. Our approach is based on the maximum likelihood estimator and its convex relaxation, and generalizes recent works in graph clustering to the biclustering setting. In addition to standard biclustering setting where one seeks to discover clustering structure simultaneously in two domain sets, we show...

متن کامل

EBIC: an artificial intelligence-based parallel biclustering algorithm for pattern discovery

In this paper a novel biclustering algorithm based on artificial intelligence (AI) is introduced. The method called EBIC aims to detect biologically meaningful, order-preserving patterns in complex data. The proposed algorithm is probably the first one capable of discovering with accuracy exceeding 50% multiple complex patterns in real gene expression datasets. It is also one of the very few bi...

متن کامل

Gene co-expression networks via biclustering Differential gene co-expression networks via Bayesian biclustering models

Identifying latent structure in large data matrices is essential for exploring biological processes. Here, we consider recovering gene co-expression networks from gene expression data, where each network encodes relationships between genes that are locally co-regulated by shared biological mechanisms. To do this, we develop a Bayesian statistical model for biclustering to infer subsets of co-re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016